Novel Heavy-Traffic Regimes for Large-Scale Service Systems
نویسندگان
چکیده
منابع مشابه
Novel Heavy-Traffic Regimes for Large-Scale Service Systems
We introduce a family of heavy-traffic regimes for large-scale service systems, presenting a range of scalings that include both moderate and extreme heavy traffic, as compared to classical heavy traffic. The heavy-traffic regimes can be translated into capacity sizing rules that lead to economies-of-scales, so that the system utilization approaches 100% while congestion remains limited. We obt...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملService Interruptions in Large-Scale Service Systems
Large-scale service systems, where many servers respond to high demand, are appealing because they can provide great economy of scale, producing a high quality of service with high efficiency. Customer waiting times can be short, with a majority of customers served immediately upon arrival, while server utilizations remain close to 100%. However, we show that this confluence of quality and effi...
متن کاملLarge Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers
The asymptotic behaviour of the M=M=n queue, with servers subject to independent breakdowns and repairs, is examined in the limit where the number of servers tends to innnity and the repair rate tends to 0, such that their product remains nite. It is shown that the limiting two-dimensional Markov process corresponds to a queue where the number of servers has the same stationary distribution as ...
متن کاملPolling systems in heavy traffic: Exhaustiveness of service policies
We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2015
ISSN: 0036-1399,1095-712X
DOI: 10.1137/140960815